#include<bits/stdc++.h>
#define ll long long
ll r[100011];
ll f[100011];

using namespace std;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    scanf("%d",&n);
    int ans=n;

    for(int i=1;i<=n;i++) scanf("%lld",&r[i]);
    sort(r+1,r+n+1);
    int i,j;
    for(i=1;i<=n;i++){
        if(r[i]==r[n])break;
        if(f[i]==-1){
            continue;}
        for(j=i;j<=n;j++){
            if(r[i]<r[j]&&f[j]!=1){
                f[i]=-1;
                f[j]=1;
                ans--;
                break;}
            }
    }
    cout<<ans;
    return 0;
}
